Duality in generalized linear fractional programming
نویسندگان
چکیده
منابع مشابه
Duality in generalized linear fractional programming
This is a generalization of a fractional programming problem (p = 1) which has been investigated quite actively in the last two decades [21 ]. In [20] many of the results in fractional programming are reviewed and extended. An extensive bibliography is given in [22]. An early application of generalized fractional programming (p > 1) is von Neumann's model of an expanding economy [25]. Here the ...
متن کاملLinear fractional programming and duality
This paper presents a dual of a general linear fractional functions programming problem. Dual is shown to be a linear programming problem. Along with other duality theorems, complementary slackness theorem is also proved. A simple numerical example illustrates the result.
متن کاملOn duality in linear fractional programming
AlcOa'act. In this paper, a dual of a given linear fractional program is defined and the weak, direct and converse duality theorems are proved. Both the primal and the dual are linear fractional programs. This duality tI-.cory leads to necessary and sufficient conditions for the optimality of a given feasible solution. A unmerical example is presented to illustrate tI'.e t~eory in this connecti...
متن کاملDuality in nondifferentiable minimax fractional programming with generalized convexity
A Mond–Weir type dual for a class of nondifferentiable minimax fractional programming problem is considered. Appropriate duality results are proved involving (F,a,q,d)-pseudoconvex functions. 2005 Elsevier Inc. All rights reserved.
متن کاملGeneralized linear fractional programming under interval uncertainty
Data in many real-life engineering and economical problems suffer from inexactness. Herein we assume that we are given some intervals in which the data can simultaneously and independently perturb. We consider a generalized linear fractional programming problem with interval data and present an efficient method for computing the range of optimal values. The method reduces the problem to solving...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 1984
ISSN: 0025-5610,1436-4646
DOI: 10.1007/bf02592224